Partial realization of descriptor systems
نویسندگان
چکیده
We address the partial realization problem for linear descriptor systems. A general solution to this problem using the Markov parameters of the system defined via its Laurent series is provided. For proper descriptor systems, we also discuss a numerically feasible algorithm for computing a partial minimal realization based on the unsymmetric Lanczos process. Applications to model reduction for two examples from computational fluid dynamics and mechanical systems with holonomic constraints are also given.
منابع مشابه
Determining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form
A common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the Weierstrass canonical form. The Weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. The present ...
متن کاملPartial Eigenvalue Assignment in Discrete-time Descriptor Systems via Derivative State Feedback
A method for solving the descriptor discrete-time linear system is focused. For easily, it is converted to a standard discrete-time linear system by the definition of a derivative state feedback. Then partial eigenvalue assignment is used for obtaining state feedback and solving the standard system. In partial eigenvalue assignment, just a part of the open loop spectrum of the standard linear s...
متن کاملGeneralized partial realizations
In this paper we extend Kalman's concept of partial realization and deene generalized partial realizations of nite matrix sequences by descriptor systems. Our deenition is in agreement with the realization theory for deterministic boundary value descriptor systems 15]. The aim of this contribution is to prove a counterpart of Kalman's main theorem of realization theory for generalized partial r...
متن کاملA Pure First Order Representation for Undamped Second Order Descriptor Systems
The aim of this paper is to analyze the undamped second order descriptor systems to show the possibility of transform an undamped second order descriptor system to a pure first order descriptor system ,on different ways, while stating some of its benefits. Meanwhile we will introduce pure first order systems and undamped second order systems and indicate that under some assumptions every undamp...
متن کاملReachability/Observability Gramians and Balanced Realization of Periodic Descriptor Systems
In this paper necessary and sufficient conditions are derived for complete reachability and observability of periodic time-varying descriptor systems. Applying these conditions, the symmetric positive semi-definite reachability/observability Gramians are defined and can be shown to satisfy some projected generalized discrete-time periodic Lyapunov equations. We propose a numerical method for so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Systems & Control Letters
دوره 55 شماره
صفحات -
تاریخ انتشار 2006